Noninteractive Verifiable Outsourcing Algorithm for Bilinear Pairing with Improved Checkability
نویسندگان
چکیده
منابع مشابه
Novel verifiable multi-secret sharing scheme using bilinear pairing
Secret sharing schemes as basic building blocks for many applications in distributed systems should be efficient and robust to any possible attacks. Based on bilinear pairing, this paper will propose a new (t, n) threshold verifiable multi-secret sharing scheme and a GGOC verifiable multi-secret sharing scheme that improve the security and minimizes the number of published values.
متن کاملAlgorithms for Outsourcing Pairing Computation
We address the question of how a computationally limited device may outsource pairing computation in cryptography to another, potentially malicious, but much more computationally powerful device. We introduce two new efficient protocols for securely outsourcing pairing computations to an untrusted helper. The first generic scheme is proven computationally secure (and can be proven statistically...
متن کاملChameleon Signature from Bilinear Pairing
Xinjun Du, Ying Wang, Jianhua Ge and Yumin Wang Key Laboratory of Computer Networks and Information Security Xidian University Abstract: Chameleon signatures are non-interactive signatures based on a hash-and-sign paradigm, and similar in efficiency to regular signatures. The distinguishing characteristic of chameleon signatures is that there are non-transferable, with only the designated recip...
متن کاملSESOS: A Verifiable Searchable Outsourcing Scheme for Ordered Structured Data in Cloud Computing
While cloud computing is growing at a remarkable speed, privacy issues are far from being solved. One way to diminish privacy concerns is to store data on the cloud in encrypted form. However, encryption often hinders useful computation cloud services. A theoretical approach is to employ the so-called fully homomorphic encryption, yet the overhead is so high that it is not considered a viable s...
متن کاملBilinear maps in Verifiable Random Functions
One of the biggest reasons for the popularity and versatility of elliptic curves in cryptography, besides the lack of “better-than-black-box” discrete log algorithms, is the presence of a bilinear map. In this short paper, we look into the definitions, motivations, and constructions of VRFs and note that groups equipped with a bilinear map can be used to construct a variety of different VRFs. ∗...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Security and Communication Networks
سال: 2017
ISSN: 1939-0114,1939-0122
DOI: 10.1155/2017/4892814